The Rural Postman Problem with time windows
نویسندگان
چکیده
In this article we consider the Rural Postman Problem with Time Windows (RPPTW) for the undirected case. The problem occurs in the monitoring of roads for black-ice detection. We give different formulations and compare them on sets of instances adapted from the literature. We propose a cutting plane algorithm to solve the problem based on valid inequalities for the Traveling Salesman Problem with Time Windows and the Precedence Constrained Traveling Salesman Problem and we tested it on a set of real-life networks. Computational results show that our algorithm is able to solve to optimality instances with up to 104 required edges. At the end of the article we extend the formulations for the undirected case to the directed case.
منابع مشابه
Capacitated Windy Rural Postman Problem with Several Vehicles: A Hybrid Multi-Objective Simulated Annealing Algorithm
This paper presents the capacitated Windy Rural Postman Problem with several vehicles. For this problem, two objectives are considered. One of them is the minimization of the total cost of all vehicle routes expressed by the sum of the total traversing cost and another one is reduction of the maximum cost of vehicle route in order to find a set of equitable tours for the vehicles. Mathematical ...
متن کاملA branch-price-and-cut method for the min-max k-windy rural postman problem
Given the edges of a graph, the postman problem consists of determining for a vehicle (postman) a shortest route that traverses all edges at least once. Each edge can be traversed in either direction and, when an edge is traversed more than once, the vehicle is said to be deadheading after its first traversal. The rural postman problem is the same as the postman problem except that the edges ar...
متن کاملEfficient Algorithms for Eulerian Extension
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in scheduling and routing and are closely related to the Chinese Postman and Rural Postman problems. Our main result is to show that the NP-hard Weighted Multigraph Eulerian Extension is fixed-parameter tractable with respect ...
متن کاملEfficient Algorithms for Eulerian Extension and Rural Postman
The aim of directed Eulerian extension problems is to make a given directed, possibly arc-weighted, (multi-)graph Eulerian by adding a minimum-cost set of arcs. These problems have natural applications in scheduling and arc routing and are closely related to the Chinese Postman and Rural Postman problems. Our main result is to show that the NP-hard WeightedMultigraph Eulerian Extension problem ...
متن کاملNew heuristic algorithms for the windy rural postman problem
In this paper we deal with the Windy Rural Postman Problem. This problem generalizes several important Arc Routing Problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a Scatter Search algorithm for the Windy Rural Postman Problem. Extensive computational experiments over different sets of instances, with sizes up to 988 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Networks
دوره 64 شماره
صفحات -
تاریخ انتشار 2014